Optimal linear arrangement of a rectangular grid
نویسندگان
چکیده
منابع مشابه
Optimal Linear Arrangement of Interval Graphs
We study the optimal linear arrangement (OLA) problem on interval graphs. Several linear layout problems that are NP-hard on general graphs are solvable in polynomial time on interval graphs. We prove that, quite surprisingly, optimal linear arrangement of interval graphs is NP-hard. The same result holds for permutation graphs. We present a lower bound and a simple and fast 2-approximation alg...
متن کامل- - - - Optimal Linear Arrangement of Circuit Components
We study the problem of arranging circuit components on a straight line so as to minimize the total wire length needed to realize the inter component nets. Branch-and-bound and dynamic programming algorithms that find optimal solutions are presented. In addition, heuristic approaches including some that employ the Monte Carlo method are developed and an experimental evaluation provided.
متن کاملOn Monochromatic Subsets of a Rectangular Grid
For n ∈ N, let [n] denote the integer set {0, 1, . . . , n − 1}. For any subset V ⊂ Z, let Hom(V ) = {cV + b : c ∈ N, b ∈ Z}. For k ∈ N, let Rk(V ) denote the least integer N0 such that for any N ≥ N0 and for any k-coloring of [N ] , there is a monochromatic subset U ∈ Hom(V ). The argument of Gallai ensures that Rk(V ) is finite. We investigate bounds on Rk(V ) when V is a three or four-point ...
متن کاملOptimal Selection of Underground Parking Lines Arrangement: A Case Study of Tehran Subway Line 7
Due to the development of urban subway lines in order to extend public transportation and to accommodate the increased number of trains, depot and parking are necessary. This is to provide a space for parking trains in non-operating hours and to carry out maintenance and repair operations on trains. Subway depot is a predetermined space where trains, washing, car parks, and refueling work are p...
متن کاملComputing an Optimal Orientation of a Balanced Decomposition Tree for Linear Arrangement Problems
Divide-and-conquer approximation algorithms for vertex ordering problems partition the vertex set of graphs, compute recursively an ordering of each part, and “glue” the orderings of the parts together. The computed ordering is specified by a decomposition tree that describes the recursive partitioning of the subproblems. At each internal node of the decomposition tree, there is a degree of fre...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Mathematics
سال: 2000
ISSN: 0012-365X
DOI: 10.1016/s0012-365x(99)00173-9